Перевод: с английского на русский

с русского на английский

bounded string

См. также в других словарях:

  • Bounded complete poset — In the mathematical field of order theory, a partially ordered set is bounded complete if all of its subsets which have some upper bound also have a least upper bound. Such a partial order can also be called consistently complete, since any upper …   Wikipedia

  • Linear bounded automaton — A linear bounded automaton (plural linear bounded automata, abbreviated LBA) is a restricted form of a non deterministic Turing machine. It possesses a tape made up of cells that can contain symbols from a finite alphabet, a head that can read… …   Wikipedia

  • Resource bounded measure — Lutz s resource bounded measure is a generalisation of Lebesgue measure to complexity classes. It was originally developed by Jack Lutz. Just as Lebesgue measure gives a method to quantify the size of subsets of the Euclidean space R^n, resource… …   Wikipedia

  • Heterotic string — This article is about string theory. For heterosis in biology, see Heterosis. String theory …   Wikipedia

  • Hilbert space — For the Hilbert space filling curve, see Hilbert curve. Hilbert spaces can be used to study the harmonics of vibrating strings. The mathematical concept of a Hilbert space, named after David Hilbert, generalizes the notion of Euclidean space. It… …   Wikipedia

  • cell — cell1 cell like, adj. /sel/, n. 1. a small room, as in a convent or prison. 2. any of various small compartments or bounded areas forming part of a whole. 3. a small group acting as a unit within a larger organization: a local cell of the… …   Universalium

  • Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …   Wikipedia

  • Shing-Tung Yau — at Harvard Law School dining hall Born …   Wikipedia

  • Communication complexity — The notion of communication complexity was introduced by Yao in 1979,[1] who investigated the following problem involving two separated parties (Alice and Bob). Alice receives an n bit string x[clarification needed] and Bob another n bit string… …   Wikipedia

  • Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… …   Wikipedia

  • List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»